context-free grammar
英 [ˈkɒntekst friː ˈɡræmə(r)]
美 [ˈkɑːntekst friː ˈɡræmər]
上下文无关语法
双语例句
- The Sequitur compression algorithm is a linear-time online algorithm that forms a context-free grammar for a given string input.
Sequitur压缩算法是线性时间在线算法，为给定的字符串输入生成了一种与上下文无关的语法。 - Finally, you can design your own programming or domain-specific language with the help of ANTLR Studio, which lets you create context-free grammar definitions based on the ANTLR framework.
最后，您可以在ANTLRStudio的帮助下设计您自己的编程语言或特定于域的语言，ANTLRStudio允许您基于ANTLR框架创建上下文自由的语法定义。 - If you work with a context-free grammar, the structure of n-gram ( see Resources) might be what you require.
如果您使用一种上下文无关的文法，那么n元语法的结构（参见参考资料）可能是您所需要的。 - A probabilistic context-free grammar ( or PCFG) is a context-free grammar that associates a probability with each of its productions.
probabilisticcontext-freegrammar（或者说是PCFG）是一种上下文无关语法，它将其每一个产品关联到一个概率。 - Ambiguity in context-free grammar
上下文自由文法中的二义性 - Computing with Words via Lattice-Valued Context-Free Grammar
格值上下文无关文法对基于词的计算 - Proposes the context-free grammar model for GEP.
对基因表达式编程建立了上下文无关文法模型。 - Fuzzy context-free grammar is one important kind of grammars.
模糊上下文无关文法是几种重要文法之一。 - The simulation and correspondence between Horn clause and context-free grammar make the most efficient algorithm-the Earley Algorithm about context-free grammar applied to the implementation of logical programs.
Horn子句和上下文无关方法的相似性、对应性，使上下文无关文法的最有效算法&Earley算法的思想，应用于逻辑程序的实现。 - Modular and Knock-together Method of Building the Context-free Grammar in Language
应用模块法杂凑语言的上下文无关文法 - According 'to the context-free grammar model of GEP, the dissertation point out that Candida's GEP techniques cannot process context-free grammar with multiple none-terminals.
根据基因表达式编程的上下文无关文法模型，指出，基因表达式编程不能处理包含多个非终结符的上下文无关文法。 - To extend the application fields of the present research, the concept of max-product fuzzy pushdown automaton was given on the basis of the study of max-product fuzzy grammars and automata, and the relationships between a max-product fuzzy context-free grammar and a max-product fuzzy pushdown automaton were investigated.
为了扩大现有研究的应用范围，基于最大乘积型Fuzzy文法与自动机引入了最大乘积型Fuzzy下推自动机的概念，并讨论了最大乘积型Fuzzy上下文无关文法与最大乘积型Fuzzy下推自动机的关系。 - An inference approach for Chinese probabilistic context-free grammar
汉语概率型上下文无关语法的自动推导 - Syntactic analysis is an important part in natural language processing ( NLP). This paper mainly discusses the syntactic analysis methods used in NLP, such as context-free grammars, transformational grammar, parsing, transition network, augmented transition network etc.
语法分析是自然语言处理中的关键环节，本文就自然语言处理中应用到的上下文无关语法、转换语法、剖析、转换网络和扩充转换网络等语法分析方法进行了论述。 - Research of the Automatic Construction Methods for Chinese Context-Free Grammar
汉语句法规则的自动构造方法研究 - Summary of Sentence Generation Methods on Context-free Grammar
上下文无关文法的句子生成方法综述 - A method of judging similarity and equivalence in context-free grammar
对上下文无关文法中的非终止符的相似性和等价性的判定 - This paper analyzes the features and drawbacks of the algorithms commonly used to parse CFG ( Context-Free Grammar), and introduces a space and time optimized algorithm for CFG.
本文分析了常用CFG（Context-freegrammar）分析算法的特点与不足。在此基础上介绍了一种时空均优化的CFG分析算法。 - The basic element of the network is called COURSE. Each COURSE is described by an attributed context-free grammar.
网络的基本单元是知识块（Course），每个知识块由上下文无关的属性文法描述。 - The research shows that if and only if a fuzzy language is produced by a max-product fuzzy context-free grammar, it can be accepted by a max-product fuzzy pushdown automaton, so the max-product fuzzy context-free language can be recognized automatically.
研究表明，当且仅当最大乘积型Fuzzy上下文无关文法产生的语言集能被最大乘积型Fuzzy下推自动机接受时，能达到自动识别最大乘积Fuzzy上下文无关语言的目的。 - Secondly, it is using the Probability-based context-free grammar to analyze sentence, and the sentence is used into symbolic forms by the BNF.
其次就是使用基于概率的上下文无关文法对句子进行分析，并且使用巴科斯范式规则将句子表示成符号形式。 - Probabilistic context-free grammar can provide a solution to this problem: select the one whose probability is maximum from the ambiguity.
概率上下文无关语法可以提供对这个问题的解决方法：从歧义中选择概率最大的解释。 - Additionally, a test coverage measurement which includes the coverage of both context-free grammar and semantic rules is defined.
在语义覆盖算法中，还定义了一个包含对上下文无关文法和以属性形式表示的语义规则覆盖的测试覆盖度量准则，用于控制算法的终止。 - Context-free grammar which is aslo referred to as phrase structure grammar, is the most commonly mathematical system used to simulate the composition structure of natural language. Syntactic analysis is based on context-free grammar to identify sentences and assign sentences 'structure.
上下文无关语法又称为短语结构语法，是模拟自然语言成分结构的最常用的数学系统。此时就可以对句子进行句法剖析了，也就是根据上下文无关语法识别一个句子并给句子指派结构。 - This paper briefly introduces the classification of words and part-of-speech tagging, then introduces a computer model of syntactic processing: context-free grammar.
本文将简要介绍单词的分类与词类标注的相关内容，在此基础上介绍句法处理的一个计算机模型：上下文无关语法。 - Many basic concepts and algorithms, such as finite automata, regular expression, context-free grammar, operator precedence algorithm, Reverse Polish Expression, etc, are be introduced and given the appropriate instance to illustrate.
同时介绍了有穷状态机，正则表达式，上下文无关文法，算符优先算法，逆波兰式等基本概念及算法，并给出了适当的实例加以说明。 - The regular expression of the basic elements and context-free grammar of flight scheduling were analyzed. Corresponding non-deterministic finite automata and abstract syntax tree were constructed, and LR parse was used.
分析了航班计划基本要素的正规式和航班计划上下文无关文法，构造了对应的不确定有限自动机和语法分析树，并研究了LR分析的应用。 - Diagonal computing model is widely used, such as local alignment algorithm in bioinformatics area, algorithm of context-free grammar in the natural language processing, parallel sorting network algorithms in the basic research and so on.
对角线模型的应用非常广泛，例如生物信息学中的局部序列比对算法、自然语言处理领域中的上下文无关文法等。